Duality between faithfulness assumptions in Graphical models

نویسنده

  • Dhafer Malouche
چکیده

In this paper we analyze the duality between two faithfulness assumptions that can be defined on a given multivariate probability distribution of a set of random variables. The first pertains to faithfulness to its concentration graph and the second pertains to faithfulness to its covariance graph. The vertices in both these graphs are in a oneto-one correspondence with the set of variables in the random vector. The concentration graph is an undirected graph constructed by looking through conditional independences between each pair of variables given the remaining variables and the covariance graph is constructed by looking through marginal independences between each pair of variables. The absence of an edge in the graph corresponds to conditional or marginal independences respectively. On each graph a separation criteria is defined which implies conditional independences present in the probability distribution: this is termed the Global Markov property. Furthermore, the faithfulness assumption is said to be satisfied when all the independence conditional statements in the probability distributions are represented in the graph. In this paper we analyze the duality between these two faithfulness hypothesis. We also prove that when the both assumptions are simultaneously satisfied, i.e., the bi-faithfulness property, all the connected components in the concentration and in the covariance graphs are either complete or all their separators have a cardinality equal to |V |− 2 where V is the number of variables.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Identifiability assumptions for directed graphical models with feedback

Directed graphical models provide a useful framework for modeling causal or directional relationships for multivariate data. Prior work has largely focused on identifiability and search algorithms for directed acyclic graphical (DAG) models. In many applications, feedback naturally arises and directed graphical models that permit cycles arise. However theory and methodology 15 for directed grap...

متن کامل

Duality for the class of a multiobjective problem with support functions under $K$-$G_f$-invexity assumptions

‎In this article‎, ‎we formulate two dual models Wolfe and Mond-Weir related to symmetric nondifferentiable multiobjective programming problems‎. ‎Furthermore‎, ‎weak‎, ‎strong and converse duality results are established under $K$-$G_f$-invexity assumptions‎. ‎Nontrivial examples have also been depicted to illustrate the theorems obtained in the paper‎. ‎Results established in this paper unify...

متن کامل

Learning Marginal AMP Chain Graphs under Faithfulness

Marginal AMP chain graphs are a recently introduced family of models that is based on graphs that may have undirected, directed and bidirected edges. They unify and generalize the AMP and the multivariate regression interpretations of chain graphs. In this paper, we present a constraint based algorithm for learning a marginal AMP chain graph from a probability distribution which is faithful to ...

متن کامل

Learning AMP Chain Graphs and some Marginal Models Thereof under Faithfulness

This paper deals with chain graphs under the Andersson-Madigan-Perlman (AMP) interpretation. In particular, we present a constraint based algorithm for learning an AMP chain graph a given probability distribution is faithful to. Moreover, we show that the extension of Meek’s conjecture to AMP chain graphs does not hold, which compromises the development of efficient and correct score+search lea...

متن کامل

Faithfulness and learning hypergraphs from discrete distributions

The concepts of faithfulness and strong-faithfulness are important for statistical learning of graphical models. Graphs are not sufficient for describing the association structure of a discrete distribution. Hypergraphs representing hierarchical log-linearmodels are considered instead, and the concept of parametric (strong-)faithfulnesswith respect to a hypergraph is introduced. The strength of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009